MinMax -profiles: A unifying view of common intervals, nested common intervals and conserved intervals of K permutations
نویسندگان
چکیده
منابع مشابه
MinMax-profiles: A unifying view of common intervals, nested common intervals and conserved intervals of K permutations
Common intervals of K permutations over the same set of n elements were firstly investigated by T. Uno and M.Yagiura (Algorithmica, 26:290:309, 2000), who proposed an efficient algorithm to find common intervals when K = 2. Several particular classes of intervals have been defined since then, e.g. conserved intervals and nested common intervals, with applications mainly in genome comparison. Ea...
متن کاملCommon intervals in permutations
An interval of a permutation is a consecutive substring consisting of consectuve symbols. For example, 4536 is an interval in the permutation 71453682. These arise in genetic applications. For the applications, it makes sense to generalize so as to allow gaps of bounded size δ− 1, both in the locations and the symbols. For example, 4527 has gaps bounded by 1 (since 3 and 6 are missing) and is t...
متن کاملFinding Nested Common Intervals Efficiently
In this article, we study the problem of efficiently finding gene clusters formalized by nested common intervals between two genomes represented either as permutations or as sequences. Considering permutations, we give several algorithms whose running time depends on the size of the actual output rather than the output in the worst case. Indeed, we first provide a straightforward cubic time alg...
متن کاملEasy Identification of Generalized Common and Conserved Nested Intervals
In this article we explain how to easily compute gene clusters, formalized by classical or generalized nested common or conserved intervals, between a set of K genomes represented as K permutations. A b-nested common (resp. conserved) interval I of size |I| is either an interval of size 1 or a common (resp. conserved) interval that contains another b-nested common (resp. conserved) interval of ...
متن کاملCommon intervals of trees
ved. In this paper we consider the problem of finding common intervals of trees, a generalization of the concept of common intervals in permutations. For a permutation π of [n] = {1,2, . . . , n}, an interval of π is a set of the form {π(i),π(i + 1), . . . , π(j)} for 1 i < j n, and any permutation of [n] has n(n−1)/2 intervals. Given a family Π = (π0, . . . , πk−1) of k 2 permutations of [n], ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.06.004